Search

Back to Home

01. Lesson Plan: Week 5
02. Introducing Peter Norvig
03. Introduction
04. What Is A Problem?
05. Example: Route Finding
06. Quiz: Tree Search
07. Tree Search Continued
08. Quiz: Graph Search
09. Quiz: Breadth First Search 1
10. Breadth First Search 2
11. Quiz: Breadth First Search 3
12. Breadth First Search 4
13. Breadth First Search 5
14. Quiz: Uniform Cost Search
15. Quiz: Uniform Cost Search 1
16. Quiz: Uniform Cost Search 2
17. Quiz: Uniform Cost Search 3
18. Quiz: Uniform Cost Search 4
19. Uniform Cost Search 5
20. Quiz: Search Comparison
21. Search Comparison 1
22. Quiz: Search Comparison 2
23. Search Comparison 3
24. On Uniform Cost
25. Quiz: A* Search
26. Quiz: A* Search 1
27. Quiz: A* Search 2
28. Quiz: A* Search 3
29. Quiz: A* Search 4
30. A* Search 5
31. Optimistic Heuristic
32. Quiz: State Spaces
33. State Spaces 1
34. Quiz: State Spaces 2
35. State Spaces 3
36. Quiz: Sliding Blocks Puzzle
37. Sliding Blocks Puzzle 1
38. Sliding Blocks Puzzle 2
39. Problems with Search
40. A Note on Implementation
41. Peter's take on AI
42. Introduction to the Lab
43. Exercise: Teaching Pac-Man to Search (Optional)
44. (Coding) Workspace: Pacman Search

Back to Home

22. Quiz: Search Comparison 2

Search Comparison 2

Search Comparison 2 Quiz

Which of these searches are complete?

Breadth-First

Cheapest-First

Depth-First

None of the above

SOLUTION:

Breadth-First
Cheapest-First

udacimak v1.3.0